The Cone of Balanced Subgraphs
نویسندگان
چکیده
In this paper we study a 2-color analog of the cycle cone of a graph. Suppose the edges of a graph are colored red and blue. A nonnegative real vector on the edges is said to be balanced if the red sum equals the blue sum at every vertex. A balanced subgraph is a subgraph whose characteristic vector is balanced (i.e., red degree equals blue degree at every vertex). By a sum (respectively, fractional sum) of cycles we mean a nonnegative integral (respectively, nonnegative rational) combination of characteristic vectors of cycles. Similarly, we define sum and fractional sum of balanced subgraphs. We show that a balanced sum of cycles is a fractional sum of balanced subgraphs.
منابع مشابه
Connected Balanced Subgraphs in Random Regular Multigraphs Under the Configuration Model∗
Our previous paper [9] applied a lopsided version of the Lovász Local Lemma that allows negative dependency graphs [5] to the space of random matchings in K2n, deriving new proofs to a number of results on the enumeration of regular graphs with excluded cycles through the configuration model [3]. Here we extend this from excluded cycles to some excluded balanced subgraphs, and derive asymptotic...
متن کاملSimultaneous well-balanced orientations of graphs
Nash-Williams’ well-balanced orientation theorem [11] is extended for orienting several graphs simultaneously. We prove that if G1, ..., Gk are pairwise edge-disjoint subgraphs of a graph G, then G has a well-balanced orientation ~ G such that the inherited orientations ~ Gi of Gi are well-balanced for all 1 ≤ i ≤ k. We also have new results about simultaneous well-balanced orientations of non-...
متن کاملA Class of Orientation-Invariant Yao-type Subgraphs of a Unit Disk Graph
We introduce a generalization of the Yao graph where the cones used are adaptively centered on a set of nearest neighbors for each node, thus creating a directed or undirected spanning subgraph of a given unit disk graph (UDG). We also permit the apex of the cones to be positioned anywhere along the line segment between the node and its nearest neighbor, leading to a class of Yao-type subgraphs...
متن کاملOn Balanced Graphs
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this concept applied to graphs, and call a graph to be balanced when its clique matrix is balanced. Characterizations of balanced graphs by forbidden subgraphs and by clique subgraphs are proved in this work. Using properties of domination we define four subclasses of balanced graphs. Two of them are char...
متن کاملPartitioning Generic Graphs into K Balanced Subgraphs
Graph partitioning is a classical graph theory problem that has proven to be NP-hard. Most of the research in literature has focused its attention on a particular case of the problem called the graph bisection problem, where k = 2, such that the parts have approximately equal weight and minimizing the size of the edge cut. In this article, we describe how to obtain balanced partitioning on a gi...
متن کامل